\documentclass[11pt,a4paper,ngerman,final]{article}

\usepackage[utf8]{inputenc}
\usepackage[T1]{fontenc}
\usepackage[ngerman]{babel}
\usepackage{lmodern}
\usepackage{graphicx}
\usepackage{acronym}
\usepackage{geometry}
\usepackage{setspace}

\geometry{
	paper	= a4paper,
	left	= 25mm,
	right	= 25mm,
	top		= 25mm,
	bottom	= 25mm
}
\onehalfspacing

\title{PCA -- ex06.2\\ $\pi$-approx. with OpenMP}
\author{Matthias Heisler, Steffen Lammel}

\begin{document}
\maketitle

\newpage
\section*{Result}
The computation core of the sequential Pi-approximation has been enhanced by the OpenMP $\#$pragma statements which adjust the programm to run in multiple threads. As expected, the best performance is reached when the number of threads equals the machines phyiscal cores (4 (or 8 if you take the virtual SMT cores into account) in case of the creek nodes)
The results of different numbers of approximation-iterations is shown in Figure below.\\

\begin{figure}[htbp]
	\label{fig:O2}
	\centering
		\fbox{ \includegraphics[page=1,scale=.8]{result.pdf} }
	\caption{Opt. Level -O2}
\end{figure}

\noindent
Interesting: When compiling the program with none of GCC's optimizations, OpenMP can not produce hardly any speed-up at all. The best performance is achieved with only one thread in most test cases. This is shown in Figure the following figure.\\

\begin{figure}[htbp]
	\label{fig:O0}
	\centering
		\fbox{ \includegraphics[page=2,scale=.8]{result.pdf} }
	\caption{No Optimization}
\end{figure}

\end{document}
